A probabilistic view of Datalog parallelization
نویسندگان
چکیده
منابع مشابه
Extending Probabilistic Datalog
In [Fuhr 95], we have proposed probabilistic Datalog (pD) as an inference engine for IR. However, a closer look at pD shows that it handles conditional probabilities only in a rather limited way, since it neither allows for the speci cation of conditional probabilities in rules nor is it able to compute conditional probabilities. Given that probabilistic IR should be interpreted as computing th...
متن کاملProbabilistic Ontologies in Datalog+/-
In logic programming the distribution semantics is one of the most popular approaches for dealing with uncertain information. In this paper we apply the distribution semantics to the Datalog+/language that is grounded in logic programming and allows tractable ontology querying. In the resulting semantics, called DISPONTE, formulas of a probabilistic ontology can be annotated with an epistemic o...
متن کاملJudgeD: A Probabilistic Datalog with Dependencies
We present JudgeD, a probabilistic datalog. A JudgeD program defines a distribution over a set of traditional datalog programs by attaching logical sentences to clauses to implicitly specify traditional data programs. Through the logical sentences, JudgeD provides a novel method for the expression of complex dependencies between both rules and facts. JudgeD is implemented as a proof-of-concept ...
متن کاملInformation Retrieval with Probabilistic Datalog
The probabilistic logical approach in Information Retrieval (IR) aims at describing the retrieval process as the computation of the probability P (d! q) that a document d implies a query q. Probabilistic Datalog (DatalogP ) is a logic that enables uncertain inference. We use DatalogP as a platform for investigating the probabilistic logical approach in IR. The expressiveness of DatalogP allows ...
متن کاملComplexity Results for Probabilistic Datalog±
We study the query evaluation problem in probabilistic databases in the presence of probabilistic existential rules. Our focus is on the Datalog± family of languages for which we define the probabilistic counterpart using a flexible and compact encoding of probabilities. This formalism can be viewed as a generalization of probabilistic databases, as it allows to generate new facts from the give...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00091-1